Algorithms : Design and analysis
By: Bhasin, Harsh
.
Publisher: New Delhi Oxford University Press 2015Edition: 1st.Description: xviii, 690p. | Binding - Paperback | 24*18.5 cm.ISBN: 9780199456666; 0199456666.Subject(s): Computer EngineeringDDC classification: 005.1 Summary: Algorithms: Design and Analysis of is a textbook designed for the undergraduate and postgraduate students of computer science engineering, information technology, and computer applications. It helps the students to understand the fundamentals and applications of algorithms. The book will serve as a useful reference for researchers and practising programmers in the field of algorithm designing. It is also indented for students preparing for interviews and competitive examinations. The book has been divided into four sections: Algorithm Basics, Data Structures, Design Techniques and Advanced Topics. The first section explains the importance of algorithms, growth of functions, recursion and analysis of algorithms. The second section covers the data structures basics, trees, graphs, sorting in linear and quadratic time. Section three discusses the various design techniques namely, divide and conquer, greedy approach, dynamic approach, backtracking, branch and bound and randomized algorithms used for solving problems in detail in separate chapters. The fourth section includes the advanced topics such as transform and conquer, decrease and conquer, number thoeretics, string matching, computational geometry, complexity classes, approximation algorithms, and parallel algorithms. Finally, the applications of algorithms in Machine Learning and Computational Biology areas are dealt with in the subsequent chapters. This section will be useful for those interested in advanced courses in algorithms. Appendixes of the book include topics such as probability, matrix operations, Red-black tress, linear programming, DFT, scheduling, a reprise of sorting, searching and amortized analysis, and problems based on writing algorithms. The concepts and algorithms in the book are explained with the help of examples which are solved using more than one method for better understanding. Each chapter of the book includes a variety of end-chapter exercises in the form of MCQs with answers, review questions, and programming exercises to help readers test their knowledge.
| Item type | Current location | Collection | Call number | Vol info | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|
Text Books
|
Departmental Library - SOET Reading Hall | Circulation | 005.1 BHA (Browse shelf) | Available | DE0292 | |||
|
Text Books
|
Departmental Library - SOET Reading Hall | Circulation | 005.1 BHA (Browse shelf) | 2021-02-15 | Available | DE0042 |
Algorithms: Design and Analysis of is a textbook designed for the undergraduate and postgraduate students of computer science engineering, information technology, and computer applications. It helps the students to understand the fundamentals and applications of algorithms. The book will serve as a useful reference for researchers and practising programmers in the field of algorithm designing. It is also indented for students preparing for interviews and competitive examinations. The book has been divided into four sections: Algorithm Basics, Data Structures, Design Techniques and Advanced Topics. The first section explains the importance of algorithms, growth of functions, recursion and analysis of algorithms. The second section covers the data structures basics, trees, graphs, sorting in linear and quadratic time. Section three discusses the various design techniques namely, divide and conquer, greedy approach, dynamic approach, backtracking, branch and bound and randomized algorithms used for solving problems in detail in separate chapters. The fourth section includes the advanced topics such as transform and conquer, decrease and conquer, number thoeretics, string matching, computational geometry, complexity classes, approximation algorithms, and parallel algorithms. Finally, the applications of algorithms in Machine Learning and Computational Biology areas are dealt with in the subsequent chapters. This section will be useful for those interested in advanced courses in algorithms. Appendixes of the book include topics such as probability, matrix operations, Red-black tress, linear programming, DFT, scheduling, a reprise of sorting, searching and amortized analysis, and problems based on writing algorithms. The concepts and algorithms in the book are explained with the help of examples which are solved using more than one method for better understanding. Each chapter of the book includes a variety of end-chapter exercises in the form of MCQs with answers, review questions, and programming exercises to help readers test their knowledge.
There are no comments for this item.